Is science inconsistent?
نویسندگان
چکیده
منابع مشابه
Is science inconsistent?
There has always been interest in inconsistency in science, not least within science itself as scientists strive to devise a consistent picture of the universe. Some important early landmarks in this history are Copernicus’s criticism of the Ptolemaic picture of the heavens, Galileo’s claim that Aristotle’s theory of motion was inconsistent, and Berkeley’s claim that the early calculus was inco...
متن کاملInconsistent Universe – Physics as a meta - science –
Physics is introduced as a semantics of a formal set theory. We consider a metatheory of a formal set theory S. We name this metatheory MS, indicating that it is a Meta-theory of S as well as a Meta-Scientific theory as Ronald Swan [1] refers to. The following arguments are all made in MS. We define in MS φ = the class of all well-formed formulae of S. This φ is a countable set in the context o...
متن کاملWhat is Ethics of Science and Technology?
Background: The existence of crises and problems such as non-compliance with standards and professional ethics in the field of engineering and technology, and existence of fraud and misuse in the field of science has resulted in importance of ethics in the science and technology. But the fact is that there is no accurate understanding of the ethics of science and technology, and this field is o...
متن کاملCurrent Theory of Real Numbers Is Inconsistent
This paper is a much shortened version of math.GM/0606635v1. In this paper, we focus only on the theory of real numbers, which is the core of the issues addressed in the previous version. We give a concise and yet rigorous proof, showing that current theory of real numbers appears to be self-inconsistent. According to the theory of real numbers, any non-degenerate interval (with different endpo...
متن کاملPuzzle: Zermelo-Fraenkel set theory is inconsistent
The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms, P , is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms, NP , has been open since it was first formulated by Cook, Karp, and Levin in 1971. In this paper, we give evidence that they are not equal by examining the SUBSET-S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2014
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-014-0463-9